Manufacturing Simulation Using Bsp Time Warp with Variable Numbers of Processors

نویسنده

  • Malcolm Yoke Hean Low
چکیده

The performance of an optimistic parallel simulation run depends on many factors. These factors range from the inherent complex nature of the simulation workload to the overhead in using the available parallel computing resources. Very often, using the maximum number of available processors for a parallel simulation run will not yield the best performance achievable. In this paper, we describe a new approach for executing BSP Time Warp optimistic parallel simulations using variable number of processors. Processors are automatically added or removed during the simulation runtime based on a performance cost model. Experiment results using this new approach on a real-world semi-conductor factory model is presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Managing External Workload with Bsp Time Warp

This paper describes an extension to the existing BSP Time Warp dynamic load-balancing algorithm to allow the management of interruption from external workload. Experiments carried out on a manufacturing simulation model using different partition strategies with and without interruption from external workload show that significant performance improvement can be achieved with external workload m...

متن کامل

A Time Slicing Approach to External Workload Management on Bsp Time Warp

The performance of a BSP Time Warp parallel simulation system on a large-scale cluster of workstations can be severely affected due to the presence of external workload on individual machine in the cluster. This paper describes a new approach to managing external workload for BSP Time Warp parallel simulation on a cluster of workstations using the approach of time slicing. Experimental results ...

متن کامل

Asynchronous (Time-Wrap) Versus Synchronous (Event-Horizon) Simulation Time Advance in BSP

This paper compares the very fundamental concepts behind two approaches to optimistic parallel discrete-event simulation on BSP computers 10]. We refer to (i) asynchronous simulation time advance as it is realised in the BSP implementation of Time Warp 3], and (ii) synchronous time advance as it is realised in the BSP implementation of Breathing Time Buckets 8]. Our results suggest that asynchr...

متن کامل

cient Computations on fault - prone BSP machines

In this paper general simulations of algorithms designed for fully operational BSP machines on BSP machines with faulty processors or unavailable processors are developed. The fail-stop model is considered, that is, if a processor fails or becomes unavailable it remains so until the end of the computation. The faults are random, that is, a processor may fail independently with probablility a, a...

متن کامل

Discrete-event simulation on the bulk-synchronous parallel model

The bulk-synchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be e ciently supported by the BSP model in practice. In this thesis we study the e cient realisation of parallel discrete-event si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002